#pragma once
#include "RBTree.h"
namespace dzp
{
	template <class K>
	class set
	{
		struct setkeyofT
		{
			const K& operator()(const K& x)
			{
				return x;
			}
		};
		
	public:
		typedef typename RBTree<K, K, setkeyofT>::iterator iterator;
		pair<iterator, bool> insert(const K& x)
		{
			return _t.insert(x);
		}
		iterator begin()
		{
			return _t.begin();
		}
		iterator end()
		{
			return _t.end();
		}
		iterator find(const K& x)
		{
			return _t.Find(x);
		}
	private:
		RBTree<K, K, setkeyofT> _t;
	};
}